Multiplicative complexity of some rational functions
نویسندگان
چکیده
منابع مشابه
Concrete Multiplicative Complexity of Symmetric Functions
The multiplicative complexity of a Boolean function f is defined as the minimum number of binary conjunction (AND) gates required to construct a circuit representing f , when only exclusive-or, conjunction and negation gates may be used. This article explores in detail the multiplicative complexity of symmetric Boolean functions. New techniques that allow such exploration are introduced. They a...
متن کاملMultiplicative complexity of vector valued Boolean functions
We consider the multiplicative complexity of Boolean functions with multiple bits of output, studying how large a multiplicative complexity is necessary and sufficient to provide a desired nonlinearity. For so-called ΣΠΣ circuits, we show that there is a tight connection between error correcting codes and circuits computing functions with high nonlinearity. Combining this with known coding theo...
متن کاملSome Characterizations of Specially Multiplicative Functions
A multiplicative function f is said to be specially multiplicative if there is a completelymultiplicative function fA such that f(m)f(n)= ∑ d|(m,n) f (mn/d)fA(d) for allm andn. For example, the divisor functions and Ramanujan’s τ-function are specially multiplicative functions. Some characterizations of specially multiplicative functions are given in the literature. In this paper, we provide so...
متن کاملCircuit Complexity and Multiplicative Complexity of Boolean Functions
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3− c lower bound on the circuit complexity of a large class of functions representable by high degree polynomials over GF(2). The key idea of the proof is a circuit complexity measure assigning different weights to XOR and AND gates.
متن کاملSome Remarks about Additive and Multiplicative Functions
The present paper contains some results about the classical multiplicative functions (n), a(n) and also about general additive and multiplicative functions. (1) It is well known that n/{n) ^x.) It is known that both fi(x) and fï(x) are strictly inc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1980
ISSN: 0304-3975
DOI: 10.1016/0304-3975(80)90072-9